/**
 * @param {number[]} arr
 * @return {number}
 */
 var findLengthOfShortestSubarray = function(arr) {
  let left=0,right,count=0
  while (left<arr.length) {
    for(right=left+1;right<arr.length;right++){
      if(arr[right]<arr[right-1]){
        count++ 
      }else{
       if(right!=arr.length-1){
         
       }
      }
    }
  }


};